A simple and effective hybrid genetic search for the job sequencing and tool switching problem

The job Sequencing and tool Switching Problem (SSP) has been extensively studied in the field of operations research, due to its practical relevance methodological interest. Given a machine that can load limited amount tools simultaneously number jobs require subset available tools, SSP seeks sequence minimizes switches machine. To solve this problem, we propose simple efficient hybrid genetic search based on generic solution representation, tailored decoding operator, local searches diversity management techniques. guide search, introduce secondary objective designed break ties. These techniques allow explore structurally different solutions escape optima. As shown our computational experiments classical benchmark instances, algorithm significantly outperforms all previous approaches while remaining apprehend easy implement. We finally report results new set larger instances stimulate future research comparative analyses.